#include<bits/stdc++.h>

using namespace std;

using LL = long long;
#define endl '\n'

bool flag;
int n, sum;
int a[22], book[555];


bool dfs(int k, int t) {
    if (k >= n)return t == 0;
    return dfs(k + 1, t) || dfs(k + 1, t - a[k]);
}

int main() {
    while (cin >> n) {
        sum = 0, flag = 0;
        fill(book + 1, book + 1 + n, 0);
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            sum += a[i];
        }
        if (sum % 2 != 0) {
            cout << "Sorry,I can't!" << endl;
            continue;
        }
        sum /= 2;


        if (!dfs(0, sum)) cout << "Sorry,I can't!" << endl;
        else cout << "Of course,I can!" << endl;
    }

    return 0;
}